简体版 繁體版 English
로그인 회원가입

commit ordering 예문

예문모바일

  • An increasingly utilized method to manage transactional conflicts in Transactional memory, and especially in STM, is Commitment ordering ( also called Commit ordering; CO ).
  • *" Not all concurrency control algorithms use locks . . . Three other techniques are timestamp ordering, serialization graph testing, and commit ordering . "'Timestamp ordering "'assigns each transaction a timestamp and ensures that conflicting operations execute in timestamp order . "'Serialization graph testing "'tracks conflicts and ensures that the serialization graph is acyclic . "'Commit ordering "'ensures that conflicting operations are consistent with the relative order in which their transactions commit, which can enable interoperability of systems using different concurrency control mechanisms ."
  • *" Not all concurrency control algorithms use locks . . . Three other techniques are timestamp ordering, serialization graph testing, and commit ordering . "'Timestamp ordering "'assigns each transaction a timestamp and ensures that conflicting operations execute in timestamp order . "'Serialization graph testing "'tracks conflicts and ensures that the serialization graph is acyclic . "'Commit ordering "'ensures that conflicting operations are consistent with the relative order in which their transactions commit, which can enable interoperability of systems using different concurrency control mechanisms ."